CONSTRUCTION OF BOUNDED DELAY CODES FOR DISCRETE NOISELESS CHANNELSFRANASZEK PA.1982; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1982; VOL. 26; NO 4; PP. 506-514; BIBL. 14 REF.Article

TREE STRUCTURED SEQUENTIAL MULTIPLE-VALUED LOGIC DESIGN FROM UNIVERSAL MODULESSINGH AD; GRAY FG; ARMSTRONG JR et al.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 9; PP. 671-674; BIBL. 9 REF.Article

FIXED LOOKAHEAD PARSING OF REGULAR GRAMMARS BY FINITE STATE MACHINESOSTRAND TJ; PAULL MC; WEYUKER EJ et al.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 340-345; BIBL. 2 REF.Conference Paper

TESTING SOFTWARE DESIGN MODELED BY FINITE STATE MACHINESCHOW TS.1977; COMPSAC 77. INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE. 1/1977-11-08/CHICAGO; USA; NEW YORK: IEEE; DA. 1977; 58-64; BIBL. 18 REF.Conference Paper

Symbolic cover minimization of fully I/O specified finite state machinesDRUSINSKY-YORESH, D.IEEE transactions on computer-aided design of integrated circuits and systems. 1990, Vol 9, Num 7, pp 779-781, issn 0278-0070, 3 p.Article

A simple protocol whose proof isn'tHAILPERN, B.IEEE transactions on communications. 1985, Vol 33, Num 4, pp 330-337, issn 0090-6778Article

A distributed alternative to finite-state-machine specificationsZAVE, P.ACM transactions on programming languages and systems. 1985, Vol 7, Num 1, pp 10-36, issn 0164-0925Article

Synthesis of communicating finite state machines with guaranteed progressGOUDA, M. G; YAO-TIN YU.IEEE transactions on communications. 1984, Vol 32, Num 7, pp 779-789, issn 0090-6778Article

Exact solutions for the construction of optimal length test sequencesRODRIGUES, M; URAL, H.Information processing letters. 1993, Vol 48, Num 6, pp 275-280, issn 0020-0190Article

Closed covers: to verify progress for communicating finite state machinesGOUDA, M. G.IEEE transactions on software engineering. 1984, Vol 10, Num 6, pp 846-855, issn 0098-5589Article

On «a simple protocol whose proof isn't»: the state machine approachGOUDA, M. G.IEEE transactions on communications. 1985, Vol 33, Num 4, pp 380-382, issn 0090-6778Article

Memory requirements of first-order digital filtersBILARDI, G; PREPARATA, F. P.IEEE Transactions on circuits and systems. II : Analog and digital signal processing. 1992, Vol 39, Num 6, pp 348-355Article

A solftware function test design using state transition diagramMASUYAMA, H.Systems, computers, controls. 1984, Vol 15, Num 1, pp 11-19, issn 0096-8765Article

Définition et réalisation d'un outil de vérification formelle de programmes LUSTRE: le système LESAR = Design and implementation of a formal verification tool for LUSTRE programs: the system LESARRatel, Christophe; Ouabdessalam, Farid.1992, 200 p.Thesis

Proving liveness for networks of communicating finite state machinesGOUDA, M. G; CHUNG-KUO CHANG.ACM transactions on programming languages and systems. 1986, Vol 8, Num 1, pp 154-182, issn 0164-0925Article

A Merging States Algorithm for Inference of RFSAsALVAREZ, Gloria; GARCIA, Pedro; RUIZ, José et al.Lecture notes in computer science. 2006, pp 340-341, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 2 p.Conference Paper

Closing the gap between software modelling and codeWAGNER, F; WAGNER, T; WOLSTENHOLME, P et al.IEEE international conference and workshop on the engineering of computer-based systems. 2004, pp 52-59, isbn 0-7695-2125-8, 1Vol, 8 p.Conference Paper

Testing from a finite-state machine : Extending invertibility to sequencesHIERONS, R. M.Computer journal (Print). 1997, Vol 40, Num 4, pp 220-230, issn 0010-4620Article

From xerox to aspell : A first prototype of a north sámi speller based on TWOL technologyGAUP, Børre; MOSHAGEN, Sjur; OMMA, Thomas et al.Lecture notes in computer science. 2006, pp 306-307, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper

Thompson digraphs: A characterizationGIAMMARRESI, Dora; PONTY, Jean-Luc; WOOD, Derick et al.Lecture notes in computer science. 2001, pp 91-100, issn 0302-9743, isbn 3-540-42812-7Conference Paper

Deriving deadlock and unspecified reception free protocol converters from message mapping setsPEYRAVIAN, M; LEA, C.-T.Computer networks and ISDN systems. 1996, Vol 28, Num 13, pp 1831-1844, issn 0169-7552Article

Formalization of edges for the Grafcet state machineGUILLAUME, M; GRAVE, J.-M; CHLIQUE, P et al.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 579-583, isbn 2-9502908-7-6Conference Paper

Model based regression test reduction using dependence analysisKOREL, Bogdan; TAHAT, Luay H; VAYSBURG, Boris et al.Proceedings - Conference on Software Maintenance. 2002, pp 214-223, issn 1063-6773, isbn 0-7695-1819-2, 10 p.Conference Paper

Online polygon search by a seven-state boundary 1-searcherKAMEDA, Tsunehiko; YAMASHITA, Masafumi; SUZUKI, Ichiro et al.IEEE transactions on robotics. 2006, Vol 22, Num 3, pp 446-460, issn 1552-3098, 15 p.Article

A complete FS model for amharic morphographemicsAMSALU, Saba; GIBBON, Dafydd.Lecture notes in computer science. 2006, pp 283-284, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper